A New Class of Public Key Cryptosystems Constructed Based on Reed-Solomon Codes, K(XII)SE(1)PKC. – Along with a presentation of K(XII)SE(1)PKC over the extension field
نویسنده
چکیده
In this paper, we present a new class of public key cryptosystem based on Reed-Solomon codes, a member of the code based PKC(CBPKC), referred to as K(XII)SE(1)PKC. We show that K(XII)SE(1)PKC can be secure against the various attacks. Particularly we present a member of K(XII)SE(1)PKC constructed based on the Reed-Solomon code over the extension field F28 , which is extensively used in the present day storage systems and the various digital transmission systems. In a sharp contrast with the conventional CBPKC that uses Goppa code, in K(XII)SE(1)PKC, we do not care for the security of the primitive polynominal that generates the Reed-Solomon code. keyword Public Key Cryptosystem, Error-Correcting Code, Reed-Solomon code, CBPKC, McEliece PKC.
منابع مشابه
Presentation of a new class of public key cryptosystems K(XIII)SE(1)PKC along with Kp(XIII)SE(1)PKC that realizes the coding rate of exactly 1.0, constructed by modifying K(XII)SE(1)PKC
In this paper, we present a new class of public key cryptosystems by modifying K(XII)SE(1)PKC [1], referred to as K(XIII)SE(1)PKC, and a particular class of K(XIII)SE(1)PKC, Kp(XIII)SE(1)PKC. We show that K(XIII)SE(1)PKC would improve both the coding rate and the security, compared with K(XII)SE(1)PKC. We also show that Kp(XIII)SE(1)PKC realizes the coding rate of exactly 1.0. In a sharp contra...
متن کاملNew Classes of Public Key Cryptosystems over F28 Constructed Based on Reed-Solomon Codes, K(XVII)SE(1)PKC and K(XVII)ΣΠPKC
In this paper, we present new classes of public key cryptosystem over F28 based on Reed-Solomon codes, referred to as K(XVII)SE(1)PKC and K(XVII)ΣΠPKC, a subclass of K(XVII)SE(1)PKC. We show that K(XV II)SE(1)PKC over F28 can be secure against the various attacks. We also present K(XVII)ΣΠPKC over F28 , a subclass of K(XVII)SE(1)PKC. We show that any assertion of successfull attack on K(XVII)SE...
متن کاملPublic Key Cryptosystems Constructed Based on Reed-Solomon Codes, K(XV)SE(2)PKC, Realizing Coding Rate of Exactly 1.0
In this paper, we present a new class of public-key cryptosystems, K(XV)SE(2)PKC realizing the coding rate of exactly 1.0, based on Reed-Solomon codes(RS codes). We show that K(XV)SE(2)PKC is secure against the various attacks including the attacks based on the Gröbner basis calculation (Gröbner basis attack, GB attack) and a linear transformation attack.
متن کاملNew classes of public key cryptosystem K(XVI)SE(1)PKC constructed based on Reed-Solomon code over extension field of m=8 and K(XVI)SE(2)PKC, based on binary cyclic code
In this paper, we first present a new class of code based public key cryptosystem(PKC) based on ReedSolomon code over extension field of less than m=9, referred to as K(XVI)SE(1)PKC. We then present a new class of quadratic multivariate PKC, K(XVI)SE(2)PKC, based on binary cyclic code. We show that both K(XVI)SE(1)PKC and K(XVI)SE(2)PKC can be secure against the various linear transformation at...
متن کاملA New Class of Public Key Cryptosystems Constructed Based on Error-Correcting Codes, Using K(III) Scheme
In this paper, we present a new scheme referred to as K(III) scheme which would be effective for improving a certain class of PKC's. Using K(III) scheme, we propose a new method for constructing the public-key cryptosystems based on error-correcting codes. The constructed PKC is referred to as K(V)SE(1)PKC. We also present more secure version of K(V)SE(1)PKC, referred to as K * (V)SE(1)PKC, usi...
متن کامل